Planning of Autonomous Multi-agent Intersection
نویسندگان
چکیده
منابع مشابه
Multi-Agent Planning Architecture for Autonomous Robots
The challenge of developing autonomous robots involves several related problems as dynamical modeling of the world, task and path planning, planning and scheduling, etc.. Traditionally, each problem has been solved and implemented in a module based architecture, where the relationships among all components are established at the design time. This kind of architectures constrains in some way the...
متن کاملMulti-Agent Planning Architecture for Autonomous Robots
The challenge of developing autonomous robots involves several related problems as dynamical modeling of the world, task and path planning, planning and scheduling, etc.. Traditionally, each problem has been solved and implemented in a module based architecture, where the relationships among all components are established at the design time. This kind of architectures constrains in some way the...
متن کاملMotion Planning Algorithms for Autonomous Intersection Management
The impressive results of the 2007 DARPA Urban Challenge showed that fully autonomous vehicles are technologically feasible with current intelligent vehicle hardware. It is natural to ask how current transportation infrastructure can be improved when most vehicles are driven autonomously in the future. Dresner and Stone proposed a new intersection control mechanism called Autonomous Intersectio...
متن کاملRobust Distributed Planning Strategies for Autonomous Multi-Agent Teams
The increased use of autonomous robotic agents, such as unmanned aerial vehicles (UAVs) and ground rovers, for complex missions has motivated the development of autonomous task allocation and planning methods that ensure spatial and temporal coordination for teams of cooperating agents. The basic problem can be formulated as a combinatorial optimization (mixed-integer program) involving nonline...
متن کاملMulti-Agent Transport Planning
We discuss a distributed transport planning problem with competitive autonomous actors that carry out time-constrained pick-up delivery orders from customers. The agents have to find conflict-free routes to execute a series of orders they have accepted. Hatzack and Nebel [2] were the first to suggest that finding such a conflict-free schedule can be reduced to solving a job shop scheduling prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ITM Web of Conferences
سال: 2016
ISSN: 2271-2097
DOI: 10.1051/itmconf/20160801007